/*
 * @Date: 2021-09-08 12:50:06
 * @Author: Acckno1
 * @LastEditTime: 2021-09-08 12:54:41
 * @Description: 
 */
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1010;
int n;
bool row[N], dg[N * 2], udg[N * 2];

inline void solution() {
    int T;
    cin >> T;
    while (T -- ) {
        cin >> n;
        mm(row, false);
        mm(dg, false);
        mm(udg, false);
        bool success = true;
        for (int y = 1; y <= n; y ++ ) {
            int x;
            cin >> x;
            if (row[x] || dg[x + y] || udg[y - x + n]) success = false;
            row[x] = dg[x + y] = udg[y - x + n] = true;
        }
        if (success) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}